PTTP+GLiDeS: Guiding Linear Deductions with Semantics
نویسندگان
چکیده
Using semantics to guide ATP systems is an under-utilised technique [10]. Two systems that have successfully employed semantic guidance are CLIN-S [1] and SCOTT [5]. In linear deduction, semantic guidance has received only limited attention, e.g., [7, 8]. Our research is developing semantic guidance for linear deduction in the Model Elimination (ME) [3] paradigm. Search pruning, at the possible loss of some refutation completeness, and search guidance, are being considered. This paper describes PTTP+GLiDeS, a PTTP style prover augmented with a semantic pruning mechanism, GLiDeS. PTTP+GLiDeS combines modified versions of Stickel’s PTTP style prover [6] and the model generator MACE [4].
منابع مشابه
Guiding Linear Deductions with Semantics
Guidance is a central issue in Automatic Theorem Proving systems due to the enormity of the search space that these systems navigate. Semantic guidance uses semantic information to direct the path an ATP system takes through the search space. The use of semantic information is potentially more powerful than syntactic information for guidance. This research aimed to discover a method for incorpo...
متن کاملGlue, Underspeci cation and Translation
Gupta and Lamping, 1998] show how linear logic based meaning constructors in the glue language semantics of Dalrymple et al., 1996] can be converted to \almost Horn clause" form using the compilation method of Hepple, 1996]. EEcient linear logic deductions deliver skeleton and modiier resources resembling Underspeciied Discourse Representation Structures (UDRSs Reyle, 1993]). In this paper we p...
متن کاملProof-nets as Logical Forms for LFG
Although ‘glue semantics’ appears to be generally accepted as LFG’s present account of semantic composition, its uptake amongst LFG practitioners doesn’t actually seem to be that extensive (and a number of well-known syntacticians have claimed to me that they are pretty much baffled by it). A possible reason for this is that the standard presentation of glue is based on term-assigning deduction...
متن کاملTheorem Prover : A New Exposition and Implementation in Prolog
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction rule that is added to Prolog inference...
متن کامل